//
// Created by xili on 2024/8/27 16:08.
// GO BIG OR GO HOME.
//
#include "leetcode.h"

class Solution {
public:
    vector<int> findWordsContaining(vector <string> &words, char x) {
        vector<int> ans;
        for (int i = 0; i < words.size(); i++) {
            auto &s = words[i];
            if (find(s.begin(), s.end(), x) != s.end()) {
                ans.push_back(i);
            }
        }
        return ans;
    }
};